Bound and Conquer: Improving Triangulation by Enforcing Consistency
نویسندگان
چکیده
منابع مشابه
Improving the accuracy of fast dense stereo correspondence algorithms by enforcing local consistency of disparity fields
Accurate, dense 3D reconstruction is an important requirement in many applications, and stereo represents a viable alternative to active sensors. However, top-ranked stereo algorithms rely on iterative 2D disparity optimization methods for energy minimization that are not well suited to the fast and/or hardware implementation often required in practice. An exception is represented by the approa...
متن کاملEnforcing Consistency on Coreference Sets
We show that intra-sentential binding constraints can act as global constraints that via transitivity enforce consistency on coreference sets. This yields about 5 % increase in performance. In our model, the probabilities of a baseline classi er for coreference resolution are used as weights in an optimization model. The underlying integer linear programming (ILP) speci cation is straightforwar...
متن کاملImproving Statistical Machine Translation Efficiency by Triangulation
In current phrase-based Statistical Machine Translation systems, more training data is generally better than less. However, a larger data set eventually introduces a larger model that enlarges the search space for the decoder, and consequently requires more time and more resources to translate. This paper describes an attempt to reduce the model size by filtering out the less probable entries b...
متن کاملParallel divide-and-conquer scheme for 2D Delaunay triangulation
This work describes a parallel divide-and-conquer Delaunay triangulation scheme. This algorithm finds the affected zone, which covers the triangulation and may be modified when two sub-block triangulations are merged. Finding the affected zone can reduce the amount of data required to be transmitted between processors. The time complexity of the divide-and-conquer scheme remains O(n log n), and...
متن کاملIncrementally Solving the STP by Enforcing Partial Path Consistency
The Simple Temporal Problem (STP) appears as a subproblem of many planning and scheduling problems. Recently, we have published a new algorithm to solve the STP, calledPC, and have showed that it outperformed all existing algorithms. Our approach was based on enforcing partial path consistency (PPC), starting from a chordal constraint graph. When dealing with complex problems, e.g. planning pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2020
ISSN: 0162-8828,2160-9292,1939-3539
DOI: 10.1109/tpami.2019.2939530